package com.cloud.code.算法.leetCode;

public class LeetCode746 {

    public static void main(String[] args) {

    }

    public int minCostClimbingStairs(int[] cost) {

        int[] dp = new int[cost.length];
        dp[0] = cost[0];
        dp[1] = cost[1];

        for (int i = 2; i < cost.length; i++) {
            dp[i] = Math.min(dp[i - 1], dp[i - 2]) + cost[i];
        }

        return Math.min(dp[dp.length - 2], dp[dp.length - 1]);
        // write code here
    }
}
